Binary Encoding Differential Evolution for Combinatorial Optimization Problems

نویسندگان

  • Changshou Deng
  • Bingyan Zhao
  • Yanlin
  • Hai Zhang
چکیده

Differential Evolution algorithm is a new competitive heuristic optimization algorithm in the continuous field. The operators in the original Differential Evolution are simple; however, these operators make it impossible to use the Differential Evolution in the binary space directly. Based on the analysis of problems led by the mutation operator of the original Differential Evolution in the binary space, a new mutation operator was proposed to enable this optimization technique can be used in binary space. The new mutation operator, which is called semi-probability mutation operator, is a combination of the original mutation operator and a new probability-based defined operator. Initial experimental results of two different combinatorial optimization problems show its effectiveness and validity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Modified Binary Differential Evolution Algorithm and its Applications

This paper proposes a novel discrete version of Differential Evolution (NBDE) algorithm to solve combinatorial optimization problems with binary variables. A new binary mutation rule is introduced derived from the table of the basic DE mutation strategy and the value of scaling factor F is 1. The eight different combinations of the three randomly selected individuals using binary encoding are d...

متن کامل

Optimization of Minimum Completion Time MTSP Based on the Improved DE

In order to solve traveling salesman problems that employed completiontimeshortest as the evaluating rule, an encoding method and improved differential evolution algorithm were proposed. In these methods, real number encoding and roulette wheel selection were adopted for improved differential evolution and neighborhood search operator was devised. It was fit for solving symmetric and asymmetric...

متن کامل

An adaptive quantum-inspired differential evolution algorithm for 0-1 knapsack problem

Differential evolution (DE) is a population based evolutionary algorithm widely used for solving multidimensional global optimization problems over continuous spaces. However, the design of its operators makes it unsuitable for many real-life constrained combinatorial optimization problems which operate on binary space. On the other hand, the quantum inspired evolutionary algorithm (QEA) is ver...

متن کامل

Testing the Permutation Space Based Geometric Differential Evolution on the Job-Shop Scheduling Problem

From within the variety of research that has been devoted to the adaptation of Differential Evolution to the solution of problems dealing with permutation variables, the Geometric Differential Evolution algorithm appears to be a very promising strategy. This approach is based on a geometric interpretation of the evolutionary operators and has been specifically proposed for combinatorial optimiz...

متن کامل

A new metaheuristic genetic-based placement algorithm for 2D strip packing

Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012